Analytic Models for Tree Communication Protocols
نویسنده
چکیده
منابع مشابه
Random Tree Models in the Analysis of Algorithms
We present three classes of random tree models tbat occur in the average case analysis of a variety of computer algorithms including symbolic manipulation algorithms, rompilling, comparison based searching and sorting, digital retrieval techniques, ble systems and communication protocols. Each model carries a coherent set of algebraic and analytic techniques, whicb we illustrate by reviewing a ...
متن کاملدرخت تجمیع داده براساس الگوریتم پویای شکل گیری رودخانه درشبکه حسگر بی سیم
One of the main challenges in Wireless Sensor Networks is the limited energy of nodes which can cause to reduce the lifetime of nodes and whole network respectively. Transmissions between the nodes consumes most of the nodes' energy so minimization of unnecessary transmissions can led to reduction of energy consumption. Therefor routing protocols designed based on optimal energy consumption are...
متن کاملModeling of VANET Technology & Ad-Hoc Routing Protocols Based on High Performance Random Waypoint Models
Today, one of the new technologies in the modern era is Vehicular Ad-hoc Network which has takenenormous attention in the recent years. Because of rapid topology changing and frequent disconnectionmakes it difficult to design an efficient routing protocol for routing data between vehicles, called V2V orvehicle to vehicle communication and vehicle to roadside infrastructure, called V2I. Designin...
متن کاملA Tableau Method for Verifying Dialogue Game Protocols for Agent Communication
In this paper, we propose a new tableau-based model checking technique for verifying dialogue game protocols for agent communication. These protocols are defined using our social commitment-based framework for agent communication called Commitment and Argument Network (CAN). We use a variant of CTL* (ACTL*) for specifying these protocols and the properties to be verified. This logic extends CTL...
متن کاملModel Checking Agent Communication
Model checking is a formal and automatic technique used to verify computational systems (e.g. communication protocols) against given properties. The purpose of this chapter is to describe a model checking algorithm to verify communication protocols used by autonomous agents interacting using dialogue games, which are governed by a set of logical rules. We use a variant of Extended Computation T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1987